All Classes and Interfaces
Class
Description
Abstraction of the algorithm classes used for finding subgraphs.
Used to supply arguments to Algorithms in a generalized manner.
An enumeration containing common arguments used by the program.
Used to process one or multiple objects.
Computes betweenness centrality for each vertex and edge in the graph.
Represents a bipartite graph as a Condition object.
Processes a
Graph searching for subgraphs by performing a breadth
first search on each node of the graph.Bron-Kersboch Algorithm to find Maximal Cliques and Bicliques.
Processes a
Graph searching for subgraphs.Represents a Clique condition.
Represents a graph condition in memory.
Represents a "conditioned" graph.
Processes a
Graph searching for connected components by performing a
depth first search.Processes a
Graph searching for bipartite subgraphs by performing a
depth first search on each node.Represents a Directed Clique condition.
A LinkedList-based Disjoint Set data structure.
Represents an Edge in memory.
A simple edge weight comparator in which the edge data is considered a
numeric value and used as the comparison benchmark.
Eigenvalues and eigenvectors of a real matrix.
FastGreedy Algorithm for Community Detection.
Girvan-Newman Algorithm for Community Detection.
Holds "Global" data that needs to be accessed by multiple parts of the
program.
Used to represent a graph in memory.
Interface used for classes designed to read graphs from memory.
Interface used by classes that write graphs to memory.
InfomapImplementation algorithm implemented using Mapping Higher-Order Network Flows in Memory
and Multilayer Networks with InfomapImplementation by Daniel Edler, Ludvig Bohlin and Martin Rosvall.
TODO: MAKE COMMENTS NICE
abc
Leading Eigenvector Algorithm for Community Detection, following Mark Newman's "Finding community structure in networks
using the eigenvectors of matrices".
Enumeration of the logging levels for the user.
Enumeration of the logging types used by the logging utility.
Logging utility for documenting the state of the program.
Louvain algorithm implemented using the brief description by Mark Newman on pages 511-512 of
"Networks Second Edition".
Interprets the command line arguments provided to the program.
Reads manifest files.
Jama = Java Matrix class.
Deprecated.
No replacement yet.
A class for writing graphs in the NOA batch format.
Represents a node in memory.
Represents a PrioritySet.
Represents an operation that can be carried out on a specific type of data.
A class for reading and writing graphs in the SIF format.
A class for reading and writing graphs.
SparseMatrix is a sparse matrix with row format.
The basic unit of the BinarySearchTree.
Walktrap Algorithm for Community Detection.